Geometry of numbers

Results: 168



#Item
31Complexity of Octagonal and Rectangular Cartograms T. Biedl and B. Genc 1  each vertex; the collection of these cyclic orders is called

Complexity of Octagonal and Rectangular Cartograms T. Biedl and B. Genc 1 each vertex; the collection of these cyclic orders is called

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:55
32CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time Marcus Schaefer

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time Marcus Schaefer

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:04:14
33arXiv:1108.0174v1 [math.DG] 31 JulLectures and notes: Mirzakhani’s volume recursion and approach for the Witten-Kontsevich theorem on moduli tautological intersection numbers Scott A. Wolpert∗

arXiv:1108.0174v1 [math.DG] 31 JulLectures and notes: Mirzakhani’s volume recursion and approach for the Witten-Kontsevich theorem on moduli tautological intersection numbers Scott A. Wolpert∗

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2011-08-01 20:13:20
34CCCG 2010, Winnipeg MB, August 9–11, 2010  On the perimeter of fat objects Prosenjit Bose∗  Otfried Cheong†

CCCG 2010, Winnipeg MB, August 9–11, 2010 On the perimeter of fat objects Prosenjit Bose∗ Otfried Cheong†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:18
35MEP Pupil TextGraphs 13.1 Positive Coordinates Coordinates are pairs of numbers that uniquely describe a position on a rectangular grid.

MEP Pupil TextGraphs 13.1 Positive Coordinates Coordinates are pairs of numbers that uniquely describe a position on a rectangular grid.

Add to Reading List

Source URL: secondary.esbergen.eu

Language: English - Date: 2011-04-12 08:53:25
36Algorithms for the Densest Sub-Lattice Problem Daniel Dadush∗ Daniele Micciancio†  November 16, 2012

Algorithms for the Densest Sub-Lattice Problem Daniel Dadush∗ Daniele Micciancio† November 16, 2012

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2013-01-22 17:01:51
37Solutions to the 2004 Nordic Mathematical Contest Problem 1 Let r be the number of balls in the red bowl, b be the number of balls in the blue bowl and y be the number of balls in the yellow bowl. Because the mean of the

Solutions to the 2004 Nordic Mathematical Contest Problem 1 Let r be the number of balls in the red bowl, b be the number of balls in the blue bowl and y be the number of balls in the yellow bowl. Because the mean of the

Add to Reading List

Source URL: www.georgmohr.dk

Language: English - Date: 2006-06-02 06:50:14
38Five Ancient Fibonacci Series In the Light of the Maya Long Count Series By Vigor Berg In collaboration with Charles William Johnson The Fibonacci numbers form a continuous sequence defined by the two

Five Ancient Fibonacci Series In the Light of the Maya Long Count Series By Vigor Berg In collaboration with Charles William Johnson The Fibonacci numbers form a continuous sequence defined by the two

Add to Reading List

Source URL: www.earthmatrix.com

Language: English - Date: 2010-10-17 21:03:34
39A Guide to Good Design + Four ways to construct a golden rectangle

A Guide to Good Design + Four ways to construct a golden rectangle

Add to Reading List

Source URL: www.finewoodworking.com

Language: English - Date: 2011-09-21 11:29:54
40Minicourse 3: Limiting Distributions in Combinatorics Michael Drmota Institute of Discrete Mathematics and Geometry

Minicourse 3: Limiting Distributions in Combinatorics Michael Drmota Institute of Discrete Mathematics and Geometry

Add to Reading List

Source URL: www.ime.usp.br

Language: English - Date: 2008-04-23 13:12:44